Parallelizing Time with Polynomial Circuits
نویسندگان
چکیده
منابع مشابه
Parallelizing quantum circuits
We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade oo in terms of depth and space complexity. As a result we distinguish a class of polynomial depth circuits that can be parallelized to logarithmic depth while adding only polynomial many auxiliary qubits. In particul...
متن کاملPolynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits
We present an interactive probabilistic proof protocol that certifies in (logN )O (1) arithmetic and Boolean operations for the verifier the determinant, for example, of an N × N matrix over a field whose entries a(i, j) are given by a single (logN )O (1)-depth arithmetic circuit, which contains (logN )O (1) field constants and which is polynomial time uniform, for example, which has size (logN...
متن کاملCounting Hierarchies: Polynomial Time and Constant Depth Circuits
In the spring of 1989, Seinosuke Toda of the University of Electro-Communications in Tokyo, Japan, proved that the polynomial hierarchy is contained in P PP To-89]. In this Structural Complexity Column, we will brieey review Toda's result, and explore how it relates to other topics of interest in computer science. In particular, we will introduce the reader to The Counting Hierarchy: a hierarch...
متن کاملPolynomial-Time Algorithms for Designing Dual-Voltage Energy Efficient Circuits
Energy consumption of digital circuits has become a primary constraint in electronic design. The increasing popularity of the portable devices like smart phone, ipad, tablet and notebook has created an overwhelming demand for extended battery life of these devices. Numerous methods for energy reduction in CMOS circuits have been proposed in the literature. Power reduction techniques at various ...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9237-z